Deciding Satisfiability of Equality Logic Formulas with Uninterpreted Functions
نویسنده
چکیده
The logic of equality with uninterpreted functions (EUF) has been proposed for verifying abstract hardware designs. Fast satisfiability checking over this logic is important for such verification to be successful. Our algorithm is based on the Davis-Putman-Logemann-Loveland (DPLL) procedure, one of the most effective methods to check propositional satisfiability. The DPLL procedure returns a satisfying assignment, if one exists. It can be extended to return all satisfying assignment. Being based on the DPLL procedure, our algorithm can adopt heuristics developed for this method.
منابع مشابه
EVC: A Validity Checker for the Logic of Equality with Uninterpreted Functions and Memories, Exploiting Positive Equality and Conservative Transformations1
The property of Positive Equality [2] dramatically speeds up validity checking of formulas in the logic of Equality with Uninterpreted Functions and Memories (EUFM) [4]. The logic expresses correctness of high-level microprocessors. We present EVC (Equality Validity Checker)—a tool that exploits Positive Equality and other optimizations when translating a formula in EUFM to a propositional form...
متن کاملEVC: A Validity Checker for the Logic of Equality with Uninterpreted Functions and Memories, Exploiting Positive Equality, and Conservative Transformations
The property of Positive Equality [2] dramatically speeds up validity checking of formulas in the logic of Equality with Uninterpreted Functions and Memories (EUFM) [4]. The logic expresses correctness of high-level microprocessors. We present EVC (Equality Validity Checker)—a tool that exploits Positive Equality and other optimizations when translating a formula in EUFM to a propositional form...
متن کاملProofs in Satisfiability Modulo Theories
Satisfiability Modulo Theories (SMT) solvers check the satisfiability of firstorder formulas written in a language containing interpreted predicates and functions. These interpreted symbols are defined either by first-order axioms (e.g. the axioms of equality, or array axioms for operators read and write,. . . ) or by a structure (e.g. the integer numbers equipped with constants, addition, equa...
متن کاملBuilding small equality graphs for deciding equality logic with uninterpreted functions
The logic of equalities with Uninterpreted Functions is used in the formal verification community mainly for proofs of equivalence: proving that two versions of a hardware design are the same, or that input and output of a compiler are semantically equivalent are two prominent examples of such proofs. We introduce a new decision procedure for this logic that generalizes two leading decision pro...
متن کاملMicroprocessor Verification Using Efficient Decision Procedures for a Logic of Equality with Uninterpreted Functions
Modern processors have relatively simple specificationsbased on their instruction set architectures. Their implementations, however, are very complex, especially with the advent of performance-enhancing techniques such as pipelining, superscalar operation, and speculative execution. Formal techniques to verify that a processor implements its instruction set specification could yield more reliab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004